Exact matrix formula for the unmixed resultant in three variables
نویسنده
چکیده
We give the first exact determinantal formula for the resultant of an unmixed sparse system of four Laurent polynomials in three variables with arbitrary support. This follows earlier work by the author on exact formulas for bivariate systems and also uses the exterior algebra techniques of Eisenbud and Schreyer.
منابع مشابه
An E cient Algorithm for the Sparse Mixed Resultant
We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be de ned as the GCD of n + 1 such d...
متن کاملAn Efficient Algorithm for the Sparse Mixed Resultant
We propose a compact formula for the mixed resultant of a system of n+1 sparse Laurent polynomials in n variables. Our approach is conceptually simple and geometric, in that it applies a mixed subdivision to the Minkowski Sum of the input Newton polytopes. It constructs a matrix whose determinant is a non-zero multiple of the resultant so that the latter can be deened as the GCD of n + 1 such d...
متن کاملSparse Resultant of Composed Polynomials IMixed-. Unmixed Case
The main question of this paper is: What happens to sparse resultants under composition? More precisely, let f1, . . . , fn be homogeneous sparse polynomials in the variables y1, . . . , yn and g1, . . . , gn be homogeneous sparse polynomials in the variables x1, . . . , xn. Let fi ◦ (g1, . . . , gn) be the sparse homogeneous polynomial obtained from fi by replacing yj by gj . Naturally a quest...
متن کاملThe resultant of an unmixed bivariate system
This paper gives an explicit method for computing the resultant of any sparse unmixed bivariate system with given support. We construct square matrices whose determinant is exactly the resultant. The matrices constructed are of hybrid Sylvester and Bézout type. The results extend those in [14] by giving a complete combinatorial description of the matrix. Previous work by D’Andrea [5] gave pure ...
متن کاملAcm Symposium on Theory of Computing (stoc 96) Sparsity Considerations in Dixon Resultants
New results relating the sparsity of nonhomogeneous polynomial systems and computation of their projection operator (a non-trivial multiple of the multivariate resultant) using Dixon's method are developed. It is demonstrated that Dixon's method of computing resultants, despite being classical, implicitly exploits the sparse structure of input polynomials. It is proved that the size of the Dixo...
متن کامل